TSTP Solution File: SYN374^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYN374^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n019.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 21 08:22:06 EDT 2024
% Result : Theorem 0.16s 0.34s
% Output : Refutation 0.16s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SYN374^5 : TPTP v8.2.0. Released v4.0.0.
% 0.09/0.11 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.10/0.31 % Computer : n019.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Mon May 20 13:54:38 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.16/0.31 This is a TH0_THM_NEQ_NAR problem
% 0.16/0.32 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.16/0.33 % (8653)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on theBenchmark for (3000ds/4Mi)
% 0.16/0.33 % (8655)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.16/0.33 % (8654)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on theBenchmark for (3000ds/27Mi)
% 0.16/0.33 % (8652)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on theBenchmark for (3000ds/183Mi)
% 0.16/0.33 % (8653)Instruction limit reached!
% 0.16/0.33 % (8653)------------------------------
% 0.16/0.33 % (8653)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.33 % (8653)Termination reason: Unknown
% 0.16/0.33 % (8653)Termination phase: Saturation
% 0.16/0.33
% 0.16/0.33 % (8653)Memory used [KB]: 5500
% 0.16/0.33 % (8653)Time elapsed: 0.004 s
% 0.16/0.33 % (8653)Instructions burned: 4 (million)
% 0.16/0.33 % (8653)------------------------------
% 0.16/0.33 % (8653)------------------------------
% 0.16/0.33 % (8658)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.16/0.33 % (8656)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.16/0.33 % (8655)Instruction limit reached!
% 0.16/0.33 % (8655)------------------------------
% 0.16/0.33 % (8655)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.33 % (8655)Termination reason: Unknown
% 0.16/0.33 % (8655)Termination phase: Saturation
% 0.16/0.33
% 0.16/0.33 % (8655)Memory used [KB]: 5500
% 0.16/0.33 % (8655)Time elapsed: 0.003 s
% 0.16/0.33 % (8655)Instructions burned: 2 (million)
% 0.16/0.33 % (8655)------------------------------
% 0.16/0.33 % (8655)------------------------------
% 0.16/0.33 % (8659)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (3000ds/3Mi)
% 0.16/0.33 % (8656)Instruction limit reached!
% 0.16/0.33 % (8656)------------------------------
% 0.16/0.33 % (8656)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.33 % (8656)Termination reason: Unknown
% 0.16/0.33 % (8656)Termination phase: Saturation
% 0.16/0.33
% 0.16/0.33 % (8656)Memory used [KB]: 5500
% 0.16/0.33 % (8656)Time elapsed: 0.003 s
% 0.16/0.33 % (8656)Instructions burned: 2 (million)
% 0.16/0.33 % (8656)------------------------------
% 0.16/0.33 % (8656)------------------------------
% 0.16/0.33 % (8659)Refutation not found, incomplete strategy
% 0.16/0.33 % (8659)------------------------------
% 0.16/0.33 % (8659)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.33 % (8659)Termination reason: Refutation not found, incomplete strategy
% 0.16/0.33
% 0.16/0.33
% 0.16/0.33 % (8659)Memory used [KB]: 5500
% 0.16/0.33 % (8659)Time elapsed: 0.003 s
% 0.16/0.33 % (8659)Instructions burned: 2 (million)
% 0.16/0.33 % (8659)------------------------------
% 0.16/0.33 % (8659)------------------------------
% 0.16/0.34 % (8654)First to succeed.
% 0.16/0.34 % (8652)Also succeeded, but the first one will report.
% 0.16/0.34 % (8658)Also succeeded, but the first one will report.
% 0.16/0.34 % (8654)Refutation found. Thanks to Tanya!
% 0.16/0.34 % SZS status Theorem for theBenchmark
% 0.16/0.34 % SZS output start Proof for theBenchmark
% 0.16/0.34 thf(func_def_0, type, cP: $i > $o).
% 0.16/0.34 thf(func_def_2, type, vEPSILON: !>[X0: $tType]:((X0 > $o) > X0)).
% 0.16/0.34 thf(func_def_5, type, sK0: $i > $i).
% 0.16/0.34 thf(f128,plain,(
% 0.16/0.34 $false),
% 0.16/0.34 inference(avatar_sat_refutation,[],[f66,f71,f72,f73,f74,f80,f83,f91,f106,f109,f117,f120,f127])).
% 0.16/0.34 thf(f127,plain,(
% 0.16/0.34 ~spl6_6 | ~spl6_11),
% 0.16/0.34 inference(avatar_contradiction_clause,[],[f126])).
% 0.16/0.34 thf(f126,plain,(
% 0.16/0.34 $false | (~spl6_6 | ~spl6_11)),
% 0.16/0.34 inference(trivial_inequality_removal,[],[f125])).
% 0.16/0.34 thf(f125,plain,(
% 0.16/0.34 ($false = $true) | (~spl6_6 | ~spl6_11)),
% 0.16/0.34 inference(forward_demodulation,[],[f70,f50])).
% 0.16/0.34 thf(f50,plain,(
% 0.16/0.34 ( ! [X7 : $i] : (($false = (cP @ X7))) ) | ~spl6_6),
% 0.16/0.34 inference(avatar_component_clause,[],[f49])).
% 0.16/0.34 thf(f49,plain,(
% 0.16/0.34 spl6_6 <=> ! [X7] : ($false = (cP @ X7))),
% 0.16/0.34 introduced(avatar_definition,[new_symbols(naming,[spl6_6])])).
% 0.16/0.34 thf(f70,plain,(
% 0.16/0.34 ((cP @ sK2) = $true) | ~spl6_11),
% 0.16/0.34 inference(avatar_component_clause,[],[f68])).
% 0.16/0.34 thf(f68,plain,(
% 0.16/0.34 spl6_11 <=> ((cP @ sK2) = $true)),
% 0.16/0.34 introduced(avatar_definition,[new_symbols(naming,[spl6_11])])).
% 0.16/0.34 thf(f120,plain,(
% 0.16/0.34 ~spl6_2 | ~spl6_5),
% 0.16/0.34 inference(avatar_contradiction_clause,[],[f119])).
% 0.16/0.34 thf(f119,plain,(
% 0.16/0.34 $false | (~spl6_2 | ~spl6_5)),
% 0.16/0.34 inference(trivial_inequality_removal,[],[f118])).
% 0.16/0.34 thf(f118,plain,(
% 0.16/0.34 ($false = $true) | (~spl6_2 | ~spl6_5)),
% 0.16/0.34 inference(forward_demodulation,[],[f47,f35])).
% 0.16/0.34 thf(f35,plain,(
% 0.16/0.34 ($false = (cP @ sK3)) | ~spl6_2),
% 0.16/0.34 inference(avatar_component_clause,[],[f33])).
% 0.16/0.34 thf(f33,plain,(
% 0.16/0.34 spl6_2 <=> ($false = (cP @ sK3))),
% 0.16/0.34 introduced(avatar_definition,[new_symbols(naming,[spl6_2])])).
% 0.16/0.34 thf(f47,plain,(
% 0.16/0.34 ((cP @ sK3) = $true) | ~spl6_5),
% 0.16/0.34 inference(avatar_component_clause,[],[f45])).
% 0.16/0.34 thf(f45,plain,(
% 0.16/0.34 spl6_5 <=> ((cP @ sK3) = $true)),
% 0.16/0.34 introduced(avatar_definition,[new_symbols(naming,[spl6_5])])).
% 0.16/0.34 thf(f117,plain,(
% 0.16/0.34 ~spl6_6 | ~spl6_9),
% 0.16/0.34 inference(avatar_contradiction_clause,[],[f116])).
% 0.16/0.34 thf(f116,plain,(
% 0.16/0.34 $false | (~spl6_6 | ~spl6_9)),
% 0.16/0.34 inference(trivial_inequality_removal,[],[f115])).
% 0.16/0.34 thf(f115,plain,(
% 0.16/0.34 ($false = $true) | (~spl6_6 | ~spl6_9)),
% 0.16/0.34 inference(forward_demodulation,[],[f114,f50])).
% 0.16/0.34 thf(f114,plain,(
% 0.16/0.34 ( ! [X0 : $i] : (((cP @ (sK0 @ X0)) = $true)) ) | (~spl6_6 | ~spl6_9)),
% 0.16/0.34 inference(trivial_inequality_removal,[],[f111])).
% 0.16/0.34 thf(f111,plain,(
% 0.16/0.34 ( ! [X0 : $i] : (($false = $true) | ((cP @ (sK0 @ X0)) = $true)) ) | (~spl6_6 | ~spl6_9)),
% 0.16/0.34 inference(backward_demodulation,[],[f61,f50])).
% 0.16/0.34 thf(f61,plain,(
% 0.16/0.34 ( ! [X0 : $i] : (((cP @ (sK0 @ X0)) = $true) | ((cP @ X0) = $true)) ) | ~spl6_9),
% 0.16/0.34 inference(avatar_component_clause,[],[f60])).
% 0.16/0.34 thf(f60,plain,(
% 0.16/0.34 spl6_9 <=> ! [X0] : (((cP @ X0) = $true) | ((cP @ (sK0 @ X0)) = $true))),
% 0.16/0.34 introduced(avatar_definition,[new_symbols(naming,[spl6_9])])).
% 0.16/0.34 thf(f109,plain,(
% 0.16/0.34 spl6_3 | ~spl6_7 | ~spl6_9),
% 0.16/0.34 inference(avatar_split_clause,[],[f108,f60,f53,f37])).
% 0.16/0.34 thf(f37,plain,(
% 0.16/0.34 spl6_3 <=> ! [X7] : ((cP @ X7) = $true)),
% 0.16/0.34 introduced(avatar_definition,[new_symbols(naming,[spl6_3])])).
% 0.16/0.34 thf(f53,plain,(
% 0.16/0.34 spl6_7 <=> ! [X2] : ($true != (cP @ X2))),
% 0.16/0.34 introduced(avatar_definition,[new_symbols(naming,[spl6_7])])).
% 0.16/0.34 thf(f108,plain,(
% 0.16/0.34 ( ! [X0 : $i] : (((cP @ X0) = $true)) ) | (~spl6_7 | ~spl6_9)),
% 0.16/0.34 inference(trivial_inequality_removal,[],[f107])).
% 0.16/0.34 thf(f107,plain,(
% 0.16/0.34 ( ! [X0 : $i] : (((cP @ X0) = $true) | ($true != $true)) ) | (~spl6_7 | ~spl6_9)),
% 0.16/0.34 inference(superposition,[],[f54,f61])).
% 0.16/0.34 thf(f54,plain,(
% 0.16/0.34 ( ! [X2 : $i] : (($true != (cP @ X2))) ) | ~spl6_7),
% 0.16/0.34 inference(avatar_component_clause,[],[f53])).
% 0.16/0.34 thf(f106,plain,(
% 0.16/0.34 ~spl6_7 | ~spl6_11),
% 0.16/0.34 inference(avatar_contradiction_clause,[],[f105])).
% 0.16/0.34 thf(f105,plain,(
% 0.16/0.34 $false | (~spl6_7 | ~spl6_11)),
% 0.16/0.34 inference(trivial_inequality_removal,[],[f104])).
% 0.16/0.34 thf(f104,plain,(
% 0.16/0.34 ($true != $true) | (~spl6_7 | ~spl6_11)),
% 0.16/0.34 inference(superposition,[],[f54,f70])).
% 0.16/0.34 thf(f91,plain,(
% 0.16/0.34 ~spl6_3 | ~spl6_10),
% 0.16/0.34 inference(avatar_contradiction_clause,[],[f90])).
% 0.16/0.34 thf(f90,plain,(
% 0.16/0.34 $false | (~spl6_3 | ~spl6_10)),
% 0.16/0.34 inference(trivial_inequality_removal,[],[f87])).
% 0.16/0.34 thf(f87,plain,(
% 0.16/0.34 ($false = $true) | (~spl6_3 | ~spl6_10)),
% 0.16/0.34 inference(superposition,[],[f38,f85])).
% 0.16/0.34 thf(f85,plain,(
% 0.16/0.34 ( ! [X0 : $i] : (($false = (cP @ (sK0 @ X0)))) ) | (~spl6_3 | ~spl6_10)),
% 0.16/0.34 inference(trivial_inequality_removal,[],[f84])).
% 0.16/0.34 thf(f84,plain,(
% 0.16/0.34 ( ! [X0 : $i] : (($false = (cP @ (sK0 @ X0))) | ($false = $true)) ) | (~spl6_3 | ~spl6_10)),
% 0.16/0.34 inference(forward_demodulation,[],[f65,f38])).
% 0.16/0.34 thf(f65,plain,(
% 0.16/0.34 ( ! [X0 : $i] : (($false = (cP @ (sK0 @ X0))) | ((cP @ X0) = $false)) ) | ~spl6_10),
% 0.16/0.34 inference(avatar_component_clause,[],[f64])).
% 0.16/0.34 thf(f64,plain,(
% 0.16/0.34 spl6_10 <=> ! [X0] : (($false = (cP @ (sK0 @ X0))) | ((cP @ X0) = $false))),
% 0.16/0.34 introduced(avatar_definition,[new_symbols(naming,[spl6_10])])).
% 0.16/0.34 thf(f38,plain,(
% 0.16/0.34 ( ! [X7 : $i] : (((cP @ X7) = $true)) ) | ~spl6_3),
% 0.16/0.34 inference(avatar_component_clause,[],[f37])).
% 0.16/0.34 thf(f83,plain,(
% 0.16/0.34 ~spl6_3 | ~spl6_7),
% 0.16/0.34 inference(avatar_contradiction_clause,[],[f82])).
% 0.16/0.34 thf(f82,plain,(
% 0.16/0.34 $false | (~spl6_3 | ~spl6_7)),
% 0.16/0.34 inference(trivial_inequality_removal,[],[f81])).
% 0.16/0.34 thf(f81,plain,(
% 0.16/0.34 ($true != $true) | (~spl6_3 | ~spl6_7)),
% 0.16/0.34 inference(superposition,[],[f54,f38])).
% 0.16/0.34 thf(f80,plain,(
% 0.16/0.34 ~spl6_3 | spl6_8),
% 0.16/0.34 inference(avatar_contradiction_clause,[],[f79])).
% 0.16/0.34 thf(f79,plain,(
% 0.16/0.34 $false | (~spl6_3 | spl6_8)),
% 0.16/0.34 inference(trivial_inequality_removal,[],[f78])).
% 0.16/0.34 thf(f78,plain,(
% 0.16/0.34 ($true != $true) | (~spl6_3 | spl6_8)),
% 0.16/0.34 inference(superposition,[],[f58,f38])).
% 0.16/0.34 thf(f58,plain,(
% 0.16/0.34 ($true != (cP @ sK1)) | spl6_8),
% 0.16/0.34 inference(avatar_component_clause,[],[f56])).
% 0.16/0.34 thf(f56,plain,(
% 0.16/0.34 spl6_8 <=> ($true = (cP @ sK1))),
% 0.16/0.34 introduced(avatar_definition,[new_symbols(naming,[spl6_8])])).
% 0.16/0.34 thf(f74,plain,(
% 0.16/0.34 spl6_3 | spl6_6 | spl6_5 | spl6_7),
% 0.16/0.34 inference(avatar_split_clause,[],[f21,f53,f45,f49,f37])).
% 0.16/0.34 thf(f21,plain,(
% 0.16/0.34 ( ! [X8 : $i,X9 : $i,X7 : $i] : (((cP @ X8) = $true) | ($false = (cP @ X7)) | ((cP @ sK3) = $true) | ((cP @ X9) != $true)) )),
% 0.16/0.34 inference(binary_proxy_clausification,[],[f17])).
% 0.16/0.34 thf(f17,plain,(
% 0.16/0.34 ( ! [X8 : $i,X9 : $i,X7 : $i] : (((cP @ X7) = (cP @ sK3)) | ((cP @ X9) != $true) | ((cP @ X8) = $true)) )),
% 0.16/0.34 inference(cnf_transformation,[],[f15])).
% 0.16/0.34 thf(f15,plain,(
% 0.16/0.34 (! [X0] : ((cP @ X0) != (cP @ (sK0 @ X0))) | ((! [X2] : ($true != (cP @ X2)) | ($true != (cP @ sK1))) & (((cP @ sK2) = $true) | ! [X5] : ((cP @ X5) = $true)))) & (! [X7] : ((cP @ X7) = (cP @ sK3)) | ((! [X8] : ((cP @ X8) = $true) | ! [X9] : ((cP @ X9) != $true)) & (((cP @ sK4) = $true) | ((cP @ sK5) != $true))))),
% 0.16/0.34 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5])],[f8,f14,f13,f12,f11,f10,f9])).
% 0.16/0.34 thf(f9,plain,(
% 0.16/0.34 ! [X0] : (? [X1] : ((cP @ X0) != (cP @ X1)) => ((cP @ X0) != (cP @ (sK0 @ X0))))),
% 0.16/0.34 introduced(choice_axiom,[])).
% 0.16/0.34 thf(f10,plain,(
% 0.16/0.34 ? [X3] : ($true != (cP @ X3)) => ($true != (cP @ sK1))),
% 0.16/0.34 introduced(choice_axiom,[])).
% 0.16/0.34 thf(f11,plain,(
% 0.16/0.34 ? [X4] : ((cP @ X4) = $true) => ((cP @ sK2) = $true)),
% 0.16/0.34 introduced(choice_axiom,[])).
% 0.16/0.34 thf(f12,plain,(
% 0.16/0.34 ? [X6] : ! [X7] : ((cP @ X6) = (cP @ X7)) => ! [X7] : ((cP @ X7) = (cP @ sK3))),
% 0.16/0.34 introduced(choice_axiom,[])).
% 0.16/0.34 thf(f13,plain,(
% 0.16/0.34 ? [X10] : ((cP @ X10) = $true) => ((cP @ sK4) = $true)),
% 0.16/0.34 introduced(choice_axiom,[])).
% 0.16/0.34 thf(f14,plain,(
% 0.16/0.34 ? [X11] : ((cP @ X11) != $true) => ((cP @ sK5) != $true)),
% 0.16/0.34 introduced(choice_axiom,[])).
% 0.16/0.34 thf(f8,plain,(
% 0.16/0.34 (! [X0] : ? [X1] : ((cP @ X0) != (cP @ X1)) | ((! [X2] : ($true != (cP @ X2)) | ? [X3] : ($true != (cP @ X3))) & (? [X4] : ((cP @ X4) = $true) | ! [X5] : ((cP @ X5) = $true)))) & (? [X6] : ! [X7] : ((cP @ X6) = (cP @ X7)) | ((! [X8] : ((cP @ X8) = $true) | ! [X9] : ((cP @ X9) != $true)) & (? [X10] : ((cP @ X10) = $true) | ? [X11] : ((cP @ X11) != $true))))),
% 0.16/0.34 inference(rectify,[],[f7])).
% 0.16/0.34 thf(f7,plain,(
% 0.16/0.34 (! [X0] : ? [X1] : ((cP @ X0) != (cP @ X1)) | ((! [X3] : ($true != (cP @ X3)) | ? [X2] : ($true != (cP @ X2))) & (? [X3] : ($true = (cP @ X3)) | ! [X2] : ($true = (cP @ X2))))) & (? [X0] : ! [X1] : ((cP @ X0) = (cP @ X1)) | ((! [X2] : ($true = (cP @ X2)) | ! [X3] : ($true != (cP @ X3))) & (? [X3] : ($true = (cP @ X3)) | ? [X2] : ($true != (cP @ X2)))))),
% 0.16/0.34 inference(nnf_transformation,[],[f6])).
% 0.16/0.34 thf(f6,plain,(
% 0.16/0.34 (! [X2] : ($true = (cP @ X2)) <=> ? [X3] : ($true = (cP @ X3))) <~> ? [X0] : ! [X1] : ((cP @ X0) = (cP @ X1))),
% 0.16/0.34 inference(ennf_transformation,[],[f5])).
% 0.16/0.34 thf(f5,plain,(
% 0.16/0.34 ~(? [X0] : ! [X1] : ((cP @ X0) = (cP @ X1)) <=> (! [X2] : ($true = (cP @ X2)) <=> ? [X3] : ($true = (cP @ X3))))),
% 0.16/0.34 inference(fool_elimination,[],[f4])).
% 0.16/0.34 thf(f4,plain,(
% 0.16/0.34 ~(? [X0] : ! [X1] : ((cP @ X1) <=> (cP @ X0)) <=> (! [X2] : (cP @ X2) <=> ? [X3] : (cP @ X3)))),
% 0.16/0.34 inference(rectify,[],[f2])).
% 0.16/0.34 thf(f2,negated_conjecture,(
% 0.16/0.34 ~(? [X0] : ! [X1] : ((cP @ X1) <=> (cP @ X0)) <=> (! [X1] : (cP @ X1) <=> ? [X0] : (cP @ X0)))),
% 0.16/0.34 inference(negated_conjecture,[],[f1])).
% 0.16/0.34 thf(f1,conjecture,(
% 0.16/0.34 ? [X0] : ! [X1] : ((cP @ X1) <=> (cP @ X0)) <=> (! [X1] : (cP @ X1) <=> ? [X0] : (cP @ X0))),
% 0.16/0.34 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cX2125)).
% 0.16/0.34 thf(f73,plain,(
% 0.16/0.34 spl6_2 | spl6_3 | spl6_7 | spl6_3),
% 0.16/0.34 inference(avatar_split_clause,[],[f20,f37,f53,f37,f33])).
% 0.16/0.34 thf(f20,plain,(
% 0.16/0.34 ( ! [X8 : $i,X9 : $i,X7 : $i] : (((cP @ X8) = $true) | ((cP @ X9) != $true) | ((cP @ X7) = $true) | ($false = (cP @ sK3))) )),
% 0.16/0.34 inference(binary_proxy_clausification,[],[f17])).
% 0.16/0.34 thf(f72,plain,(
% 0.16/0.34 spl6_10 | spl6_11 | spl6_3),
% 0.16/0.34 inference(avatar_split_clause,[],[f23,f37,f68,f64])).
% 0.16/0.34 thf(f23,plain,(
% 0.16/0.34 ( ! [X0 : $i,X5 : $i] : (($false = (cP @ (sK0 @ X0))) | ((cP @ X0) = $false) | ((cP @ X5) = $true) | ((cP @ sK2) = $true)) )),
% 0.16/0.34 inference(binary_proxy_clausification,[],[f18])).
% 0.16/0.34 thf(f18,plain,(
% 0.16/0.34 ( ! [X0 : $i,X5 : $i] : (((cP @ X0) != (cP @ (sK0 @ X0))) | ((cP @ X5) = $true) | ((cP @ sK2) = $true)) )),
% 0.16/0.34 inference(cnf_transformation,[],[f15])).
% 0.16/0.34 thf(f71,plain,(
% 0.16/0.34 spl6_9 | spl6_3 | spl6_11),
% 0.16/0.34 inference(avatar_split_clause,[],[f22,f68,f37,f60])).
% 0.16/0.34 thf(f22,plain,(
% 0.16/0.34 ( ! [X0 : $i,X5 : $i] : (((cP @ X0) = $true) | ((cP @ sK2) = $true) | ((cP @ X5) = $true) | ((cP @ (sK0 @ X0)) = $true)) )),
% 0.16/0.34 inference(binary_proxy_clausification,[],[f18])).
% 0.16/0.34 thf(f66,plain,(
% 0.16/0.34 spl6_7 | spl6_10 | ~spl6_8),
% 0.16/0.34 inference(avatar_split_clause,[],[f25,f56,f64,f53])).
% 0.16/0.34 thf(f25,plain,(
% 0.16/0.34 ( ! [X2 : $i,X0 : $i] : (($true != (cP @ sK1)) | ($false = (cP @ (sK0 @ X0))) | ((cP @ X0) = $false) | ($true != (cP @ X2))) )),
% 0.16/0.34 inference(binary_proxy_clausification,[],[f19])).
% 0.16/0.34 thf(f19,plain,(
% 0.16/0.34 ( ! [X2 : $i,X0 : $i] : (($true != (cP @ sK1)) | ($true != (cP @ X2)) | ((cP @ X0) != (cP @ (sK0 @ X0)))) )),
% 0.16/0.34 inference(cnf_transformation,[],[f15])).
% 0.16/0.34 % SZS output end Proof for theBenchmark
% 0.16/0.34 % (8654)------------------------------
% 0.16/0.34 % (8654)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.34 % (8654)Termination reason: Refutation
% 0.16/0.34
% 0.16/0.34 % (8654)Memory used [KB]: 5500
% 0.16/0.34 % (8654)Time elapsed: 0.006 s
% 0.16/0.34 % (8654)Instructions burned: 5 (million)
% 0.16/0.34 % (8654)------------------------------
% 0.16/0.34 % (8654)------------------------------
% 0.16/0.34 % (8651)Success in time 0.016 s
% 0.16/0.34 % Vampire---4.8 exiting
%------------------------------------------------------------------------------